منابع مشابه
PP is Closed Under Truth-Table Reductions
Beigel, Reingold and Spielman 2] showed that PP is closed under intersection and a variety of special cases of polynomial-time truth-table closure. We extend the techniques in 2] to show PP is closed under general polynomial-time truth-table reductions. We also show that PP is closed under constant-round truth-table reductions.
متن کاملPP Is Closed under Intersection
In his seminal paper on probabilistic Turing machines, Gill 13] asked whether the class PP is closed under intersection and union. We give a positive answer to this question. We also show that PP is closed under a variety of polynomial-time truth-table reductions. Consequences in complexity theory include the deenite collapse and (assuming P 6 = PP) separation of certain query hierarchies over ...
متن کاملBounded Truth Table Reductions of PJin
If there is a sparse set hard for P under bounded truth table reductions computable in LOGSPACE or NC 2 , then P = NC 2. We give the details of the proof to this theorem.
متن کاملProbabilistic Polynomial Time is Closed under Parity Reductions
We show that probabilistic polynomial time (PP) is closed under polynomial-time parity reductions. As corollaries, we show that several complexity classes are contained in PP. Results Comparing the power of various computational paradigms is a central concern of computational complexity theory. In this paper, we study the power of PP by asking whether it is closed downwards under polynomial-tim...
متن کاملBounded Truth Table Reductions of PJin - yi Cai
If there is a sparse set hard for P under bounded truth table reductions computable in LOGSPACE or NC 2 , then P = NC 2. We give the details of the proof to this theorem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1996
ISSN: 0890-5401
DOI: 10.1006/inco.1996.0001